Truthful mechanisms for combinatorial AC electric power allocation

Traditional studies of combinatorial auctions often only consider linear constraints (by which the demands for certain goods are limited by the corresponding supplies). The rise of smart grid presents a new class of auctions, characterized by quadratic constraints. Yu and Chau [AAMAS 13’] introduced the complex-demand knapsack problem, in which the demands are complex-valued and the capacity of supplies is described by the magnitude of total complex-valued demand. This naturally captures the power constraints in AC electric systems. In this paper, we provide a more complete study and generalize the problem to the multi-minded version, beyond the previously known 1 2 -approximation algorithm for only a subclass of the problem. More precisely, we give a truthful PTAS for the case φ ∈ [0, π 2 ], and a truthful bi-criteria FPTAS for the general case φ ∈ ( 2 , π− ], where φ is the maximum angle between any two complex-valued demands.